Herrmann's Beautiful Theorem on Computable Partial Orderings
نویسنده
چکیده
We give an exposition of Herrmann’s proof that there is an infinite computable partial ordering with no infinite Σ 2 chains or
منابع مشابه
Ordered Structures and Computability Ordered Structures and Computability Dedication
We consider three questions surrounding computable structures and orderings. First, we make progress toward answering a question of Downey, Hirschfeldt, and Goncharov by showing that for a large class of countable linear orderings, the Turing degree spectrum of the successor relation is closed upward in the c.e. degrees. Next we consider computable partial orders (specifically, finitely branchi...
متن کاملChains and antichains in partial orderings
We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is Σ1 or Π 1 1, and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the differenc...
متن کاملComputable Linearizations of Well-partial-orderings
We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results. De Jongh and Parikh showed that every well-partial-order has a linearization of maximal order type. We show that such a linearization can be found computably. We also show that the process of finding such a linearization is no...
متن کاملOn self-embeddings of computable linear orderings
The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem.
متن کاملOn computable self-embeddings of computable linear orderings
Wemake progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding. The precise characterization of those computable linear orderings which have computable copies without nontrivial computable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017